Bounds for Ramsey numbers of complete graphs dropping an edge
نویسندگان
چکیده
Let Kn − e be a graph obtained from a complete graph of order n by dropping an edge, and let G p be a Paley graph of order p. It is shown that if G p contains no Kn−e, then r(Kn+1−e) ≥ 2p+1. For example, G1493 contains no K13 − e, so r(K14 − e) ≥ 2987, improving the old bound 2557. It is also shown that r(K2 + G) ≤ 4r(G, K2 + G)− 2, implying that r(Kn − e) ≤ 4 r(Kn−2, Kn − e)− 2. c © 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
Induced Graph Ramsey Theory
We say that a graph F strongly arrows (G, H) and write F (G, H) if for every edge-coloring of F with colors red and blue a red G or a blue H occurs as an induced subgraph of F . Induced Ramsey numbers are defined by r(G, H) = min{|V (G)| : F (G, H)}. The value of r(G, H) is finite for all graphs, and good upper bounds on induced Ramsey numbers in general, and for particular families of grap...
متن کاملAnti-Ramsey numbers in complete split graphs
A subgraph of an edge-coloured graph is rainbow if all of its edges have different colours. For graphs G and H the anti-Ramsey number ar(G,H) is the maximum number of colours in an edge-colouring of G with no rainbow copy of H. The notion was introduced by Erdős, Simonovits and V. Sós and studied in case G = Kn. Afterwards exact values or bounds for anti-Ramsey numbers ar(Kn, H) were establishe...
متن کاملRainbow Ramsey Numbers of Stars and Matchings
Expanding on a recent definition by Bialostocki and Voxman, we define the rainbow ramsey number RR(G1, G2) of two graphs G1 and G2 to be the minimum integer N such that any edge-coloring of the complete graph KN with any number of colors must contain either a copy of G1 with every edge the same color or a copy of G2 with every edge a different color. This number is well-defined if G1 is a star ...
متن کاملMulticolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs
Let H1, . . . ,Hk be graphs. The multicolor Ramsey number r(H1, . . . ,Hk) is the minimum integer r such that in every edge-coloring of Kr by k colors, there is a monochromatic copy of Hi in color i for some 1 ≤ i ≤ k. In this paper, we investigate the multicolor Ramsey number r(K2,t, . . . ,K2,t,Km), determining the asymptotic behavior up to a polylogarithmic factor for almost all ranges of t ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 29 شماره
صفحات -
تاریخ انتشار 2008